Adjusting scheduling model with release and due dates in production planning
نویسندگان
چکیده
منابع مشابه
Single-machine scheduling with release dates, due dates and family setup times
We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery performance, between maximizing machine utilization by batching similar jobs and maximizing customers’ satis...
متن کاملScheduling with Uncertain Release Dates
The aim of the paper is to examine whether we can adapt Bent and van Hentenryck’s combination methods to our problem, and to determine how effective and significant the methods are. In particular, we develop four ways of applying Bent and Van Hentenryck’s consensus approach[3] to our problem. In addition, since we assume the uncertainty distribution is known, we propose a probabilistic sampling...
متن کاملAdjustments of Release and Due Dates for Cumulative Scheduling Problems
This paper presents a set of satisfiability tests and time-bound adjustments that can be applied to cumulative scheduling problems. We introduce the Cumulative Scheduling Problem (CuSP), an extension of the m-machine problem in which activities, having both release and due dates, can require more than one unit of the resource. Given a CuSP instance, we present two necessary conditions for the e...
متن کاملSingle Machine Scheduling with Release Dates
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a time-indexed formulation, the other on a completiontime formulation. We show their equivalence by proving that a O(n logn) greedy algorithm leads to optimal solutions to both relax...
متن کاملScheduling Problem with Discretely Compressible Release Dates
In this paper, we address the scheduling model with discretely compressible release dates, where processing any job with a compressed release date incurs a corresponding compression cost. We consider the following problem: scheduling with discretely compressible release dates to minimize the sum of makespan plus total compression cost. We show its NP-hardness, and design an approximation algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cogent Engineering
سال: 2017
ISSN: 2331-1916
DOI: 10.1080/23311916.2017.1321175